Verifying Distributed Directory-Based Cahce Coherence Protocols: S3.mp, a Case Study

نویسندگان

  • Fong Pong
  • Andreas Nowatzyk
  • Gunes Aybay
  • Michel Dubois
چکیده

This paper presents the results for the verification of the S3.mp cache coherence protocol. The S3.mp protocol uses a distributed directory with limited number of pointers and hardware supported overflow handling that keeps processing nodes sharing a data block in a singly linked list. The complexity of the protocol is high and its validation is challenging because of the distributed algorithm used to maintain the linked lists and the non-FIFO network. We found several design errors, including an error which only appears in verification models of more than three processing nodes, which is very unlikely to be detected by intensive simulations. We believe that methods described in this paper are applicable to the verification of other linked list based protocols such as the IEEE Scalable Coherent Interface.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Distributed Directory-based Cache Coherence Protocols: S3.mp, a Case Study

This paper presents the results for the verification of the S3.mp cache coherence protocol. The S3.mp protocol uses a distributed directory with limited number of pointers and hardware supported overflow handling that keeps processing nodes sharing a data block in a singly linked list. The complexity of the protocol is high and its validation is challenging because of the distributed algorithm ...

متن کامل

Exact and Efficient Verification of Parameterized Cache Coherence Protocols

We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. For reasoning about general snoopy cache protocols, we introduce the guarded broadcast protocols model and show how an abstract history graph construction can be used to reason about safety properties for this framework. Althoug...

متن کامل

Carnegie Mellon University Unbounded System Verification Using Decision Procedure and Predicate Abstraction

Modeling and analysis of systems with large, infinite or parameterized state spaces has received much attention in the last decade. These systems include microprocessors with unbounded buffers and memories; parameterized cache-coherence and communication protocols with unbounded channels; and distributed algorithms for mutual exclusion. Most previous works have either used general purpose theor...

متن کامل

Directoryless shared memory architecture using thread migration and remote access

Distributed directory cache coherence protocols for current many-core CMPs are not only difficult and error-prone to implement and verify, but also provide suboptimal performance when a thread requires access to large amounts of data distributed across the chip: the data must be brought to the core where the thread is running, incurring delays and energy costs. In this paper, we propose an appr...

متن کامل

Delta Coherence Protocols Isotach Systems Caching in Distributed Systems

a distributed shared memory in distributed computations, and as the replica control problem in distributed databases. This article describes the home update protocol, a member of the class of coherence protocols called delta coherence protocols that uses isotach guarantees1 to solve the coherence problem in a new and highly concurrent way. (Due to space constraints, and to avoid obscuring the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995